Parallel Pattern Matcher CS267 Final Project
نویسندگان
چکیده
As the critical dimension in optical lithography continues to shrink and integrated circuit masks become more complex, it is becoming more important to determine where the layout is affected the most by non-ideal process conditions. If the most problematic shapes can be identified and represented in a simple way, then these test patterns can be used to locate areas in any layout that are the most sensitive to these process effects. After the ‘hot spots’ have been found, the designer can use these results to go back and alter the geometry to reduce the sensitivity to these effects. This procedure will reduce the effects of imperfect optics on the printing of the image from the mask to the wafer, improving the yield of the design. Locations of interest can be filtered to include only points along edges, line ends, inside corners, and/or outside corners. Additional information on the pattern matching theory and validation, applications of pattern matching, and pattern matching algorithms is available from SPIE and ISQED. Some of the pattern matching concepts and algorithms are similar to those used in Optical Proximity Correction (OPC). The general pattern matching method presented here can be used to search for matches between any user-defined bitmap image and any set of input polygons on multiple layers involving complex floating-point number weights. A typical 128 by 128 pixel pattern yields reasonable speed vs. accuracy and is scaled to represent a radius of several wavelengths. Examples of pattern matching runs involving lithographic lens aberration patterns matched to phase-shifting masks are shown in Figure 1 and Figure 2. The pattern matching algorithms have been optimized for efficient processing of full chip layouts, such as the one shown in Figure 3. Frank Gennari has been working on the pattern matching system as Ph.D. research for the past three years. The goal of this paper is not to describe the pattern matcher work in great detail but to explain how we converted a large sequential program into a scalable parallel program.
منابع مشابه
Sp 04 CS267 Final Project: Parallelization of oopd1
oopd1 is a new object-oriented particle in cell (particle-mesh) code for modeling plasma kinetics being written by the Plasma Theory and Simulation Group (PTSG). oopd1 is an acronym for Object-Oriented Plasma Device 1-Dimension, and is a more unified and extensible replacement for the previous PTSG suite of C 1d particle in cell (PIC) codes – xpdp1, xpdc1, xpds1 – each written for a separate co...
متن کاملComparison of Cell and POWER5 Architectures for a Flocking Algorithm: A Performance and Usability Study CS267 Final Project
We have parallelized and optimized an agent-based simulation of emergent flocking behavior for two shared-memory architectures: the POWER5 and the Cell Broadband Engine. The goal of this study was to explore the affordances and trade-offs of both architectures and their available APIs, especially for addressing the load-balancing issues caused by the uneven spatial distribution of flocking agen...
متن کاملCroMatcher - results for OAEI 2013
CroMatcher is an ontology matching system based on terminological and structural matchers. The most important part of the system is automated weighted aggregation of correspondences produced by using different basic ontology matchers. This is the first year CroMatcher has been involved in the OAEI campaign. The results obtained this year will certainly help in finding and resolving shortcomings...
متن کاملImplementation of Rabin Karp String Matching Algorithm Using MPI
Searching for occurrences of string patterns is a common problem in many applications. One of the easiest approaches is to search a pattern in a text character by character. But this method becomes very slow when we deal with long patterns. Various good solutions like Naïve string Matcher, Knuth-Morris-Pratt (KMP), Rabin Karp (RK), etc have already been presented for string matching and we sele...
متن کاملA Memory-Efficient Pattern Matching with Hardware-Based Bit-Split String Matchers for Deep Packet Inspection
This paper proposes a hardware-based parallel pattern matching engine using a memory-based bit-split string matcher architecture. The proposed bit-split string matcher separates the transition table from the state table, so that state transitions towards the initial state are not stored. Therefore, total memory requirements can be minimized. key words: computer network security, deep packet ins...
متن کامل